Graphs of polyhedra; polyhedra as graphs
نویسنده
چکیده
Relations between graph theory and polyhedra are presented in two contexts. In the first, the symbiotic dependence between 3-connected planar graphs and convex polyhedra is described in detail. In the second, a theory of nonconvex polyhedra is based on a graph-theoretic foundation. This approach eliminates the vagueness and inconsistency that pervade much of the literature dealing with polyhedra more general than the convex ones.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملNon-redundant Graph Representation of Polyhedral Networks
Infinite homogeneous networks in crystal structures with a single kind of coordination polyhedron and a single kind of connection between polyhedra can be represented by so-called quotient graphs or direction-labeled graphs [1],[2]. These finite graphs may be obtained from periodic nets by graph folding based upon translational symmetries. Taking all given symmetries into account this folding c...
متن کاملSteinitz Theorems for Simple Orthogonal Polyhedra
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz’s theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric pro...
متن کاملPolyhedra of Small Order and Their Hamiltonian Properties
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes include polyhedra with up 13 vertices, simplicial polyhedra with up to 16 vertices, 4-connected polyhedra with up to 15 vertices, non-Hamiltonian polyhedra with up to 15 vertices, bipartite polyhedra with up to 24 vertices, and bipartite trivalent polyhedra with up to 44 vertices. The results of th...
متن کاملPrimal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007